The uniqueness of the strongly regular graph $\mathrm{srg}(105,32,4,12)$

On the Strongly Regular Graph of Parameters

In an attempt to find a strongly regular graph of parameters (99, 14, 1, 2) or to disprove its existence, we studied its possible substructure and constructions.

Structure and uniqueness of the (81, 20, 1, 6) strongly regular graph

Brouwer, A.E, W.H. Haemers, Structure and uniqueness of the (81,20, 1.6) strongly regular graph, Discrete Mathematics 106/107 (1992) 77-82. We prove that there is a unique graph (on 81 vertices) with spectrum 20’2”‘(-7)*“. We give several descriptions of this graph, and study its structure. Let r = (X, E) be a strongly regular graph with parameters (v, k, ;1, p) = (81, 20, 1, 6). Then r (that i...

the plain x-ray the diagnosis of the acute abdomen_

چکیده ندارد.

Classification of some strongly regular subgraphs of the McLaughlin graph

By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, λ, μ) = (105, 32, 4, 12), (120, 42, 8, 18) and (176, 70, 18, 34) are unique upto isomorphism. Each of these graphs occurs as an induced subgraph in the strongly regular McLaughlin graph. We have used an orderly backtracking algorithm with look-ahead and look-back strategies, applying...

The Maximum Number of Edges in a Strongly Multiplicative Graph